b-Coloring graphs with large girth
نویسندگان
چکیده
منابع مشابه
Equitable coloring planar graphs with large girth
A proper vertex coloring of a graph G is equitable if the size of color classes differ by at most one. The equitable chromatic threshold of G, denoted by ∗Eq(G), is the smallest integer m such that G is equitably n-colorable for all n m. We prove that ∗Eq(G) = (G) if G is a non-bipartite planar graph with girth 26 and (G) 2 or G is a 2-connected outerplanar graph with girth 4. © 2007 Elsevier B...
متن کاملGraphs with large girth are b-continuous
A b-coloring of the vertices of a graph is a proper coloring where each color class contains a vertex which is adjacent to each other color class. The b-chromatic number of G is the maximum integer b(G) for which G has a b-coloring with b(G) colors. A graph G is b-continuous if G has a b-coloring with k colors, for every integer k in the interval [χ(G), b(G)]. It is known that not all graphs ar...
متن کامل(2 + ϵ)-Coloring of planar graphs with large odd-girth
The odd-girth of a graph is the length of a shortest odd circuit. A conjecture by Pavol Hell about circular coloring is solved in this article by showing that there is a function f( ) for each : 0 < < 1 such that, if the odd-girth of a planar graph G is at least f( ), then G is (2 + )-colorable. Note that the function f( ) is independent of the graph G and → 0 if and only if f( )→∞. A key lemma...
متن کاملn-Tuple Coloring of Planar Graphs with Large Odd Girth
The main result of the papzer is that any planar graph with odd girth at least 10k À 7 has a homomorphism to the Kneser graph G 2k1 k , i.e. each vertex can be colored with k colors from the set f1; 2;. .. ; 2k 1g so that adjacent vertices have no colors in common. Thus, for example, if the odd girth of a planar graph is at least 13, then the graph has a homomorphism to G 5 2 , also known as...
متن کاملOnline coloring graphs with high girth and high odd girth
We give an upper bound for the online chromatic number of graphs with high girth and for graphs with high oddgirth generalizing Kierstead’s algorithm for graphs that contain neither a C3 or C5 as an induced subgraph. keywords: online algorithms, combinatorial problems
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Brazilian Computer Society
سال: 2012
ISSN: 0104-6500,1678-4804
DOI: 10.1007/s13173-012-0063-9